Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Programming (Mathematics) --- Mathematical programming --- Goal programming --- Algorithms --- Functional equations --- Mathematical optimization --- Operations research

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Written in a conversational tone, this classroom-tested text introduces the fundamentals of linear programming and game theory, showing readers how to apply serious mathematics to practical real-life questions by modelling linear optimization problems and strategic games. The treatment of linear programming includes two distinct graphical methods. The game theory chapters include a novel proof of the minimax theorem for 2x2 zero-sum games. In addition to zero-sum games, the text presents variable-sum games, ordinal games, and n-player games as the natural result of relaxing or modifying the assumptions of zero-sum games. All concepts and techniques are derived from motivating examples, building in complexity, which encourages students to think creatively and leads them to understand how the mathematics is applied. With no prerequisite besides high school algebra, the text will be useful to motivated high school students and undergraduates studying business, economics, mathematics, and the social sciences.

Linear programming. --- Game theory. --- Games, Theory of --- Theory of games --- Mathematical models --- Mathematics --- Production scheduling --- Programming (Mathematics) --- Linear Programming --- Game theory --- Linear Programming.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Constraint Satisfaction Problems (CSPs) are natural computational problems that appear in many areas of theoretical computer science. Exploring which CSPs are solvable in polynomial time and which are NP-hard reveals a surprising link with central questions in universal algebra. This monograph presents a self-contained introduction to the universal-algebraic approach to complexity classification, treating both finite and infinite-domain CSPs. It includes the required background from logic and combinatorics, particularly model theory and Ramsey theory, and explains the recently discovered link between Ramsey theory and topological dynamics and its implications for CSPs. The book will be of interest to graduate students and researchers in theoretical computer science and to mathematicians in logic, combinatorics, and dynamics who wish to learn about the applications of their work in complexity theory.

Constraint programming (Computer science) --- Computational complexity. --- Linear programming. --- Constraints (Artificial intelligence) --- Mathematics. --- Constraint satisfaction (Artificial intelligence) --- Artificial intelligence --- Production scheduling --- Programming (Mathematics) --- Complexity, Computational --- Electronic data processing --- Machine theory --- Computer programming

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Dynamic programming (DP) has a relevant history as a powerful and flexible optimization principle, but has a bad reputation as a computationally impractical tool. This book fills a gap between the statement of DP principles and their actual software implementation. Using MATLAB throughout, this tutorial gently gets the reader acquainted with DP and its potential applications, offering the possibility of actual experimentation and hands-on experience. The book assumes basic familiarity with probability and optimization, and is suitable to both practitioners and graduate students in engineering, applied mathematics, management, finance and economics.

Operations research. --- Decision making. --- Management science. --- Economic theory. --- Numerical analysis. --- Economics, Mathematical . --- Engineering economics. --- Engineering economy. --- Operations Research/Decision Theory. --- Operations Research, Management Science. --- Economic Theory/Quantitative Economics/Mathematical Methods. --- Numerical Analysis. --- Quantitative Finance. --- Engineering Economics, Organization, Logistics, Marketing. --- Economy, Engineering --- Engineering economics --- Industrial engineering --- Economics --- Mathematical economics --- Econometrics --- Mathematics --- Mathematical analysis --- Economic theory --- Political economy --- Social sciences --- Economic man --- Quantitative business analysis --- Management --- Problem solving --- Operations research --- Statistical decision --- Deciding --- Decision (Psychology) --- Decision analysis --- Decision processes --- Making decisions --- Management decisions --- Choice (Psychology) --- Operational analysis --- Operational research --- Management science --- Research --- System theory --- Methodology --- Decision making --- Dynamic programming. --- Methodology. --- Mathematical optimization --- Programming (Mathematics) --- Systems engineering --- Econometrics. --- Industrial Management. --- Operations Research and Decision Theory. --- Operations Research, Management Science . --- Quantitative Economics. --- Mathematics in Business, Economics and Finance. --- Mathematics. --- Economics, Mathematical --- Statistics --- Business administration --- Business enterprises --- Business management --- Corporate management --- Corporations --- Industrial administration --- Management, Industrial --- Rationalization of industry --- Scientific management --- Business --- Industrial organization

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This book constitutes the proceedings of the 22nd Conference on Integer Programming and Combinatorial Optimization, IPCO 2021, which took place during May 19-21, 2021. The conference was organized by Georgia Institute of Technology and planned to take place it Atlanta, GA, USA, but changed to an online format due to the COVID-19 pandemic. The 33 papers included in this book were carefully reviewed and selected from 90 submissions. IPCO is under the auspices of the Mathematical Optimization Society, and it is an important forum for presenting the latest results of theory and practice of the various aspects of discrete optimization.

Computer science—Mathematics. --- Computer communication systems. --- Algorithms. --- Data structures (Computer science). --- Software engineering. --- Mathematics of Computing. --- Computer Communication Networks. --- Algorithm Analysis and Problem Complexity. --- Data Structures. --- Software Engineering/Programming and Operating Systems. --- Computer software engineering --- Engineering --- Information structures (Computer science) --- Structures, Data (Computer science) --- Structures, Information (Computer science) --- Electronic data processing --- File organization (Computer science) --- Abstract data types (Computer science) --- Algorism --- Algebra --- Arithmetic --- Communication systems, Computer --- Computer communication systems --- Data networks, Computer --- ECNs (Electronic communication networks) --- Electronic communication networks --- Networks, Computer --- Teleprocessing networks --- Data transmission systems --- Digital communications --- Electronic systems --- Information networks --- Telecommunication --- Cyberinfrastructure --- Network computers --- Foundations --- Distributed processing --- Integer programming --- Programming (Mathematics) --- Computer networks. --- Information theory. --- Design and Analysis of Algorithms. --- Data Structures and Information Theory. --- Software Engineering. --- Communication theory --- Communication --- Cybernetics